Type 1.x Generalized Feistel Structures
نویسندگان
چکیده
We formalize the Type 1.x Generalized Feistel Structure (GFS) in order to fill the gap between Type 1 and Type 2 GFSs. This is a natural extension of Type 1 and Type 2 GFSs, and covers them as special cases. The diffusion property of GFS is known to vary depending on the permutation used in the round function. When we have two non-linear functions in one round, we propose a permutation that has a good diffusion property, and compare it with the structure that uses a sub-block-wise cyclic shift. We also present experimental results of exhaustively evaluating the diffusion properties of all permutations up to eight sub-blocks.
منابع مشابه
Differential Attacks on Generalized Feistel Schemes
While generic attacks on classical Feistel schemes and unbalanced Feistel schemes have been studied a lot, generic attacks on several generalized Feistel schemes like type-1, type-2 and type-3 and Alternating Feistel schemes, as defined in [6], have not been systematically investigated. This is the aim of this paper. We give our best Known Plaintext Attacks and non-adaptive Chosen Plaintext Att...
متن کاملOn Generalized Feistel Networks
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions may have n ̸= m; (2) alternating Feistel networks, where the round functions alternate between contracting and expanding; (3) type-1, type-2, and type-3 Feistel networks, where n-bit to n-bit round functions are used t...
متن کاملImproved Differential Cryptanalysis on Generalized Feistel Schemes
Nachef et al [12] used differential cryptanalysis to study four types of Generalized Feistel Scheme (GFS). They gave the lower bound of maximum number of rounds that is indistinguishable from a random permutation. In this paper, we study the security of several types of GFS by exploiting the asymmetric property. We show that better lower bounds can be achieved for the Type-1 GFS, Type-3 GFS and...
متن کاملQuantum Cryptanalysis on Some Generalized Feistel Schemes
Post-quantum cryptography has attracted much attention from worldwide cryptologists. In ISIT 2010, Kuwakado and Morii gave a quantum distinguisher with polynomial time against 3-round Feistel networks. However, generalized Feistel schemes (GFS) have not been systematically investigated against quantum attacks. In this paper, we study the quantum distinguishers about some generalized Feistel sch...
متن کاملParallelizing the Camellia and SMS4 Block Ciphers - Extended version
The n-cell GF-NLFSR (Generalized Feistel-NonLinear Feedback Shift Register) structure [8] is a generalized unbalanced Feistel network that can be considered as a generalization of the outer function FO of the KASUMI block cipher. An advantage of this cipher over other n-cell generalized Feistel networks, e.g. SMS4 [11] and Camellia [5], is that it is parallelizable for up to n rounds. In hardwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 97-A شماره
صفحات -
تاریخ انتشار 2014